Convex Polygons in Geometric Triangulations
نویسندگان
چکیده
We show that the maximum number of convex polygons in a triangulation of n points in the plane is O(1.5029). This improves an earlier bound of O(1.6181) established by van Kreveld, Löffler, and Pach (2012) and almost matches the current best lower bound of Ω(1.5028) due to the same authors. Given a planar straight-line graph G with n vertices, we also show how to compute efficiently the number of convex polygons in G.
منابع مشابه
New Results on Optimal Area Triangulations of Convex Polygons
We consider the problems of finding two optimal triangulations of convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programmi...
متن کاملQuadratic Time Computable Instances of Maxmin and Minmax Area Triangulations of Convex Polygons
We consider the problems of finding two optimal triangulations of a convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic program...
متن کاملInterpolation Error Estimates for Harmonic Coordinates on Polytopes
Interpolation error estimates in terms of geometric quality measures are established for harmonic coordinates on polytopes in two and three dimensions. First we derive interpolation error estimates over convex polygons that depend on the geometric quality of the triangles in the constrained Delaunay triangulation of the polygon. This characterization is sharp in the sense that families of polyg...
متن کاملFair Triangulations
We describe the statistics of checkerboard triangulations obtained by colouring black every other triangle in triangulations of convex polygons.1
متن کاملFlipping edge-labelled triangulations
Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique labels to the triangulation edges. We introduce the concept of the orbit of an edge e, which is the set of all edges reachable from e via flips. We establish the...
متن کامل